Efficient iterative methods for FIR least squares identification

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive iterative reweighted least squares design of Lp FIR filters

This paper presents an efficient adaptive algorithm for designing FIR digital filters that are efficient according to an Lp error criteria. The algorithm is an extension of Burrus’ iterative reweighted least-squares (IRLS) method for approximating Lp filters. Such algorithm will converge for most significant cases in a few iterations. In some cases however, the transition bandwidth is such that...

متن کامل

Iterative reweighted least-squares design of FIR filters

ABSTRACT This paper presents an efficient adaptive algorithm for designing FIR digital filters that are efficient according to an error criteria. The algorithm is an extension of Burrus’ iterative reweighted least-squares (IRLS) method for approximating filters. Such algorithm will converge for most significant cases in a few iterations. In some cases however, the transition bandwidth is such t...

متن کامل

Least{squares Multirate FIR Filters

The authors propose a new least{squares design procedure for multirate FIR lters with any desired shape of the (band{limited) frequency response. The aliasing, inherent in such systems, is implicitly taken into account in the approximation criterion.

متن کامل

Least-Squares-Based Iterative Identification Algorithm for Wiener Nonlinear Systems

This paper focuses on the identification problem ofWiener nonlinear systems.The application of the key-term separation principle provides a simplified form of the estimated parameter model. To solve the identification problem of Wiener nonlinear systems with the unmeasurable variables in the information vector, the least-squares-based iterative algorithm is presented by replacing the unmeasurab...

متن کامل

Preconditioned Iterative Methods for Solving Linear Least Squares Problems

New preconditioning strategies for solving m × n overdetermined large and sparse linear least squares problems using the CGLS method are described. First, direct preconditioning of the normal equations by the Balanced Incomplete Factorization (BIF) for symmetric and positive definite matrices is studied and a new breakdown-free strategy is proposed. Preconditioning based on the incomplete LU fa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Acoustics, Speech, and Signal Processing

سال: 1990

ISSN: 0096-3518

DOI: 10.1109/29.56046